Linear-Time Algorithms for Proportional Apportionment
نویسندگان
چکیده
The apportionment problem deals with the fair distribution of a discrete set of k indivisible resources (such as legislative seats) to n entities (such as parties or geographic subdivisions). Highest averages methods are a frequently used class of methods for solving this problem. We present an O(n)-time algorithm for performing apportionment under a large class of highest averages methods. Our algorithm works for all highest averages methods used in practice.
منابع مشابه
Vector and matrix apportionment problems and separable convex integer optimization
Algorithms for the proportional rounding of a nonnegative vector, and for the biproportional rounding of a nonnegative matrix are discussed. Here we view vector and matrix rounding as special instances of a generic optimization problem that employs an additive version of the objective function of Gaffke and Pukelsheim (2007). The generic problem turns out to be a separable convex integer optimi...
متن کاملAn optimal policy for deteriorating items with time-proportional deterioration rate and constant and time-dependent linear demand rate
In this paper, an economic order quantity (EOQ) inventory model for a deteriorating item is developed with the following characteristics: (i) The demand rate is deterministic and two-staged, i.e., it is constant in first part of the cycle and linear function of time in the second part. (ii) Deterioration rate is time-proportional. (iii) Shortages are not allowed to occur. The o...
متن کاملA Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment
Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms that implement divisor methods: one by Cheng and Eppstein [CE14] has worst-case optimal running time but is complex, while the other [Puk14] is relatively sim...
متن کاملMultiwinner Approval Rules as Apportionment Methods
We establish a link between multiwinner elections and apportionment problems by showing how approval-based multiwinner election rules can be interpreted as methods of apportionment. We consider several multiwinner rules and observe that they induce apportionment methods that are well-established in the literature on proportional representation. For instance, we show that Proportional Approval V...
متن کاملA majorization comparison of apportionment methods in proportional representation
From the inception of the proportional representation movement it has been an issue whether larger parties are favored at the expense of smaller parties in one apportionment of seats as compared to another apportionment. A number of methods have been proposed and are used in countries with a proportional representation system. These apportionment methods exhibit a regularity of order, as discus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014